Boolean Functions from AG-Codes
نویسندگان
چکیده
Propagation criterion of degree l and order k (PC(l) of order k) and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1, 2, 3, 6, 7,8,10,11,16]. Kurosawa , Stoh [8] and Carlet [1] gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, algebraic-geometric codes over GF (2) are used to modify Carlet and
منابع مشابه
Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes
Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1], [2], [3], [4], [7], [8], [10], [11] and [16]). Kurosawa , Stoh [8] and Carlet [1] gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper algebraic-geometric codes over GF (2m) are used to modify the Carlet and Kur...
متن کاملA construction of binary linear codes from Boolean functions
Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of progress on the study of applications of Boolean functions in coding theory has been made. Two generic constructions of binary linear codes with Boolean functions have bee...
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملConstructing PC(l) of order k Boolean Functions from Algebraic-Geometric Codes
Propagation criterion of degree l and order k (PC(l) of order k) for Boolean functions is important for the design of block ciphers. In [1-2] Kurosawa , Stoh and Carlet give several constructions of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes.
متن کاملOn Self-Dual Quantum Codes, Graphs, and Boolean Functions
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006